Scheduling interval orders with release dates and deadlines
نویسنده
چکیده
We study the problem of scheduling unit-length tasks with release dates and deadlines subject to precedence constraints and unit communication delays. Two polynomial-time algorithms are de ned: one constructs schedules for graphs with uniform release dates, the other for graphs with arbitrary release dates. They have a special structure: unlike most scheduling algorithms, they do not consider individual tasks, but pairs of tasks. It is proved that the algorithms nd minimum-lateness schedules for interval orders on an arbitrary number of processors.
منابع مشابه
Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملA fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملScheduling of the FlexRAY communication protocol respecting AUTOSAR FlexRay COM stack
The objective of the paper is the formulation and solution of the frame packing and scheduling problem for the static segment with respect to AUTOSAR FlexRay COM stack. There are several other works on the static segment scheduling. The problem becomes more constrained since the release dates and deadlines of the signals are taken into account. While assuming release dates and deadlines to be m...
متن کاملApplication of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines
متن کامل
Minimizing Total Completion Time for Preemptive Scheduling with Release Dates and Deadline Constraints
It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NPhard. Du and Leung solved some special cases by the generalized Baker’s algorithm and the generalized Smith’s algorithm in O(n) time. In this paper we give an O(n) algorithm for the special case where the processing times and deadlines are agreeab...
متن کامل